Computational complexity theory

Results: 2049



#Item
541Analysis of algorithms / Triangulation / Computational complexity theory / Time complexity / Algorithm / Randomized algorithm / Big O notation / Delaunay triangulation / Planar separator theorem / Theoretical computer science / Mathematics / Applied mathematics

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:56
542Complexity classes / NP-complete problems / Mathematical optimization / NP-hard / Time complexity / NP / Independent set / P versus NP problem / Clique / Theoretical computer science / Computational complexity theory / Applied mathematics

CS 373 Final Exam (December 15, 2000) Fall 2000

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:48:10
543Computational complexity theory / Logic gates / Circuit complexity / Secure multi-party computation / Levenshtein distance / XOR gate / Boolean circuit / Circuit / Adder / Theoretical computer science / Applied mathematics / Cryptographic protocols

Faster Secure Two-Party Computation Using Garbled Circuits Yan Huang David Evans University of Virginia

Add to Reading List

Source URL: www.usenix.org

Language: English - Date: 2011-06-09 13:31:32
544Binary trees / Analysis of algorithms / Computational complexity theory / Time complexity / Dynamic programming / Interval graph / Tree decomposition / Rope / Interval tree / Graph theory / Theoretical computer science / Mathematics

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models Binay K. Bhattacharya∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-06-24 09:52:12
545Computational complexity theory / Mathematics / Context of computational complexity / Horner scheme / Algorithm / Mathematical logic / Theoretical computer science

Distributed Computing FS 2013 Prof. R. Wattenhofer / Jara Uitto

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:46
546Operations research / NP-complete problems / Computational complexity theory / Travelling salesman problem / Approximation algorithm / Linear programming / Algorithm / Polygon / Theoretical computer science / Mathematics / Applied mathematics

CCCG 2010, Winnipeg MB, August 9–11, 2010 The traveling salesman problem for lines and rays in the plane Adrian Dumitrescu∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:19
547Analysis of algorithms / NP-complete problems / Adversary model / Gossip protocol / Clique / Time complexity / Algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

Gossiping in a Multi-Channel Radio Network An Oblivious Approach to Coping with Malicious Interference (Extended Abstract) Shlomi Dolev1 , Seth Gilbert2 , Rachid Guerraoui3 , and Calvin Newport4 1

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2007-09-28 06:21:17
548Network theory / Shortest path problem / NP-complete problems / Connectivity / Euclidean plane geometry / Analysis of algorithms / Path decomposition / Minimum spanning tree / Theoretical computer science / Computational complexity theory / Mathematics

The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:46
549Operations research / Combinatorial optimization / Mathematical optimization / NP-complete problems / Algorithm / Mathematical logic / Knapsack problem / Optimization problem / Genetic algorithm / Applied mathematics / Theoretical computer science / Computational complexity theory

Generation of Efficient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano

Add to Reading List

Source URL: www.sic.shibaura-it.ac.jp

Language: English - Date: 2014-02-04 09:21:05
550Pseudorandomness / Cryptography / Computational complexity theory / Algorithmic information theory / Pseudorandom generator / Pseudorandom function family / Obfuscated code / Advantage / Obfuscation / Mathematics / Theoretical computer science / Applied mathematics

On the Correlation Intractability of Obfuscated Pseudorandom Functions Ran Canetti∗ Yilei Chen†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-22 00:12:34
UPDATE